A Kilobit Special Number Field Sieve Factorization
نویسندگان
چکیده
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 2 − 1. Although this factorization is orders of magnitude ‘easier’ than a factorization of a 1024-bit RSA modulus is believed to be, the methods we used to obtain our result shed new light on the feasibility of the latter computation.
منابع مشابه
A Kilobit Hidden SNFS Discrete Logarithm Computation
We perform a special number field sieve discrete logarithm computation in a 1024-bit prime field. To our knowledge, this is the first kilobit-sized discrete logarithm computation ever reported for prime fields. This computation took a little over two months of calendar time on an academic cluster using the open-source CADO-NFS software. Our chosen prime p looks random, and p−1 has a 160-bit pri...
متن کاملFactorization of a 1061-bit number by the Special Number Field Sieve
I provide the details of the factorization of the Mersenne number 21061 − 1 by the Special Number Field Sieve. Although this factorization is easier than the completed factorization of RSA-768, it represents a new milestone for factorization using publicly available software.
متن کاملMersenne Factorization Factory
We present new factors of seventeen Mersenne numbers, obtained using a variant of the special number field sieve where sieving on the algebraic side is shared among the numbers. It reduced the overall factoring effort by more than 50%. As far as we know this is the first practical application of Coppersmith’s “factorization factory” idea. Most factorizations used a new double-product approach t...
متن کاملLecture Notes in Computer Science 4833
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 2 − 1. Although this factorization is orders of magnitude ‘easier’ than a factorization of a 1024-bit RSA modulus is believed to be, the methods we used to obtain our result shed new light on the feasibility of t...
متن کاملSpecial-Purpose Hardware for Factoring:the NFS Sieving Step
In the quest for factorization of larger integers, the present bottleneck is the sieving step of the Number Field Sieve algorithm. Several special-purpose hardware architectures have been proposed for this step: TWINKLE (based on electro-optics), mesh circuits (based on two-dimensional systolic arrays) and TWIRL (based on parallel processing pipelines). For 1024-bit composites, the use of such ...
متن کامل